Cooperative planning for multi-site asteroid visual coverage

Cooperative Aerial Coverage Path Planning for Visual Inspection of Complex Infrastructures

This article addresses the problem of Cooperative Coverage Path Planning (C-CPP) for the inspection of complex infrastructures (offline 3D reconstruction) by utilizing multiple Unmanned Autonomous Vehicles (UAVs). The proposed scheme, based on a priori 3D model of the infrastructure under inspection, is able to generate multiple paths for UAVs in order to achieve a complete cooperative coverage...

Multi-Robot Path Planning for Selective Coverage

In this paper we propose a reward-driven finitehorizon model akin to a Markov Decision Process to extract the maximum amount of valuable data in least amount of time. We present a path planning algorithm that generates off-line trajectories for multiple robots to cover a region of interest by visiting the hot-spots in increasing order of their significance. An underlying distribution is assumed...

Cooperative Path-Planning for Multi-Vehicle Systems

In this paper, we propose a collision avoidance algorithm for multi-vehicle systems, which is a common problem in many areas, including navigation and robotics. In dynamic environments, vehicles may become involved in potential collisions with each other, particularly when the vehicle density is high and the direction of travel is unrestricted. Cooperatively planning vehicle movement can effect...

Multi-Agent Planning for Non-Cooperative Agents

At least three major subproblems can be distinguished in a multi-agent planning problem: a task allocation problem (which agent performs which subtasks), an individual planning problem for each of the agents involved (how to ensure that the tasks allocated to me can be performed), and a plan coordination problem (how to ensure that the individual planning processes can be integrated into an ove...

Cooperative heuristi multi-agent planning